翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

axiom schema of specification : ウィキペディア英語版
axiom schema of specification

In many popular versions of axiomatic set theory the axiom schema of specification, also known as the axiom schema of separation, subset axiom scheme or axiom schema of restricted comprehension is an axiom schema. Essentially, it says that any definable subclass of a set is a set.
Some mathematicians call it the axiom schema of comprehension, although others use that term for ''unrestricted'' comprehension, discussed below.
Because restricted comprehension solved Russell's paradox, several mathematicians including Zermelo, Fraenkel, and Gödel considered it the most important axiom of set theory.
== Statement ==
One instance of the schema is included for each formula φ in the language of set theory with free variables among ''x'', ''w''1, ..., ''w''''n'', ''A''. So ''B'' is not free in φ. In the formal language of set theory, the axiom schema is:
:\forall w_1,\ldots,w_n \, \forall A \, \exists B \, \forall x \, ( x \in B \Leftrightarrow (x \in A \and \varphi(x, w_1, \ldots, w_n , A) ) )
or in words:
: Given any set ''A'', there is a set ''B'' such that, given any set ''x'', ''x'' is a member of ''B'' if and only if ''x'' is a member of ''A'' and φ holds for ''x''.
Note that there is one axiom for every such predicate φ; thus, this is an axiom schema.
To understand this axiom schema, note that the set ''B'' must be a subset of ''A''. Thus, what the axiom schema is really saying is that, given a set ''A'' and a predicate ''P'', we can find a subset ''B'' of ''A'' whose members are precisely the members of ''A'' that satisfy ''P''. By the axiom of extensionality this set is unique. We usually denote this set using set-builder notation as . Thus the essence of the axiom is:
: Every subclass of a set that is defined by a predicate is itself a set.
The axiom schema of specification is characteristic of systems of axiomatic set theory related to the usual set theory ZFC, but does not usually appear in radically different systems of alternative set theory. For example, New Foundations and positive set theory use different restrictions of the axiom of comprehension of naive set theory. The Alternative Set Theory of Vopenka makes a specific point of allowing proper subclasses of sets, called semisets. Even in systems related to ZFC, this scheme is sometimes restricted to formulas with bounded quantifiers, as in Kripke–Platek set theory with urelements.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「axiom schema of specification」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.